Ascending Paths and Forcings That Specialize Higher Aronszajn Trees
نویسنده
چکیده
In this paper, we study trees of uncountable regular heights containing ascending paths of small width. This combinatorial property of trees generalizes the concept of a cofinal branch and it causes trees to be non-special not only in V, but also in every cofinality-preserving outer model of V. Moreover, under certain cardinal arithmetic assumptions, the non-existence of such paths through a tree turns out to be equivalent to the statement that the given tree is special in a cofinality preserving forcing extension of the ground model. We will present a number of consistency results on the non-existence of trees without cofinal branches containing ascending paths of small width. In contrast, we will construct such trees using certain combinatorial principles. As an application of our results, we show that the consistency strength of a potential forcing axiom for σ-closed, well-met partial orders satisfying the א2-chain condition and collections of א2-many dense subsets is at least a weakly compact cardinal. In addition, we will use our results to show that the infinite productivity of the Knaster property characterizes weak compactness in canonical inner models. Finally, we study the influence of the Proper Forcing Axiom on trees containing ascending paths.
منابع مشابه
Specializing Aronszajn Trees by Countable Approximations
We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.
متن کاملSpecialising Aronszajn trees by countable approximations
We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.
متن کاملSpecialising Aronszajn Trees and Preserving Some Weak Diamonds
We show that ♦(R,N ,∈) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. The weak diamond for the covering relation of Lebesgue null sets was the only weak diamond in the Cichoń diagramme for relations whose consistency together with “all Aronszajn trees are special” was not yet settled. Our forcing proof gives also new proofs to the known consistencies of se...
متن کاملExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model with no Aronszajn tree over אω+2 from the optimal assumptions. This answers a question of Friedman and Halilović [1]. The reader interested only in Friedman and Halilović question may skip the first section and go directly to the second. 1 No branches to κAronszajn trees. We deal here wi...
متن کاملFresh subsets of ultrapowers
In [8], Shelah and Stanley constructed a κ-Aronszjan tree with an ascent path using κ. We show that κ,2 does not imply the existence of Aronszajn trees with ascent paths. The proof goes through an intermediate combinatorial principle, which we investigate further.
متن کامل